This is the second part of the first report in a series devoted to exploring the interface or "junction" between computer science and category theory. Both benefit from this exploration: computer science by a powerful set of tools and a general methodoloqy providing a rigorous and uniform approach to many of its basic concepts, methods, and questions; and category theory by a nontrivial collection of practical applications and illustrations, plus a number of new problems and results. Our present general purposes are to provide a clear, leisurely, and well-illustrated introduction to the basic lanquage of category theory, and to give introductory formulations of some of the computer science topics, including programs, machines, automata, and languages.
This Part covers graphs and diagrams, and introduces the third key categorial concept, natural transformation. An extended example covering correctness and termination of flow-diagram programs illustrates many of the concepts covered so far in the series.
By: J. A. Goguen, J. W. Thatcher, E. G. Wagner, J. B. Wright
Published in: RC5908 in 1976
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .